BitStore: An Incentive-Compatible Solution for Blocked Downloads in BitTorrent

نویسندگان

  • Anirudh Ramachandran
  • Atish Das Sarma
  • Nick Feamster
چکیده

As many as 30% of all files shared on public BitTorrent networks suffer from the lack of “seeders” (peers that have complete copies of the file being shared); peers attempting to download such a file (“leechers”) may have to wait indefinitely to obtain certain file chunks that are not distributed in the file’s network of peers (the “swarm”). We call this the Blocked Leecher Problem (BLP). To alleviate BLP, we propose BitStore, a larger, secure network of BitTorrent users (not necessarily all sharing the same content) where nodes offer their resources (such as disk space and bandwidth) for public use. Peers sharing any file can use the storage network to maintain replicas for each chunk of the file. Any leecher seeking chunks that are absent from in its own swarm can query the public network, locate the node storing the said chunks, and retrieve them. BitStore also provides robust incentives for nodes contributing resources: In return for storing and serving chunks, such nodes can negotiate micropayments using a second-price auction. Peers who receive these credits may later use them to retrieve blocks they need from the storage network. This paper quantifies the BLP, presents an overview of the BitStore design, and discusses various challenges related to storage management and incentives.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A peer-to-peer incentives mechanism for sharing small and rare files

The peer-to-peer paradigm is an important alternative to the traditional client-server model in computer networks, making up a significant share of the bandwidth used globally. In client-server scenarios there usually is an external reason of why the server provides its service to the clients. But there usually is no external incentive in peer-topeer networks to share data. In fact there are tw...

متن کامل

VoIP Call Performance Over IPv6 During HTTP and Bittorrent Downloads

We study the performance of a VoIP call in an IPv6 network during download of a large file using HTTP, BitTorrent, or uTP, and simultaneous downloads using HTTP and BitTorrent or HTTP and uTP. Performance metrics include maximum delta, maximum and mean jitter, throughput, packet loss, and perceived voice quality. The results indicate that the values of these metrics are stable and that call qua...

متن کامل

Adaptive Search Radius for BitTorrent Swarms

Peer-to-Peer systems are responsible for a large fraction of the traffic generated on the Internet, affecting other applications and incurring in high costs for Internet Service Providers. One of those systems, BitTorrent, is widely used worldwide, causing a continuous flow of traffic, translating in the congestion of Internet links. In an effort to restrict the reach (localize) of the traffic ...

متن کامل

Toward Efficient On-Demand Streaming with BitTorrent

This paper considers the problem of adapting the BitTorrent protocol for on-demand streaming. BitTorrent is a popular peer-to-peer file sharing protocol that efficiently accommodates a large number of requests for file downloads. Two components of the protocol, namely the rarest-first piece selection policy and the tit-for-tat algorithm for peer selection, are acknowledged to contribute toward ...

متن کامل

BISTRO: BitTorrent Based on Space-Time Trade-Off

Due to the content bundling and the dramatic increase of content size, the download performance in peer-to-peer networks has become a research focus again recently. In this paper, we propose a novel approach to improve the download performance based on the classical space-time trade-off. With the approach, a peer can speed up local downloads in peer-to-peer networks by contributing a portion of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007